Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming
نویسندگان
چکیده
منابع مشابه
Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming
Let a polyhedral convex set be given by a finite number of linear inequalities and consider the problem to project this set onto a subspace. This problem, called polyhedral projection problem, is shown to be equivalent to multiple objective linear programming. The number of objectives of the multiple objective linear program is by one higher than the dimension of the projected polyhedron. The r...
متن کاملLinear Programming and Polyhedral Combinatorics
This is a special case of a projection onto a linear space (here, we consider only coordinate projection). By repeatedly projecting, we can eliminate any subset of coordinates. We claim that Pk is also a polyhedron and this can be proved by giving an explicit description of Pk in terms of linear inequalities. For this purpose, one uses Fourier-Motzkin elimination. Let P = {x : Ax ≤ b} and let •...
متن کاملGeometric Duality in Multiple Objective Linear Programming
We develop in this article a geometric approach to duality in Multiple Objective Linear Programming. This approach is based on a very old idea, the duality of polytopes, which can be traced back to the old Greeks. We show that there is an inclusion reversing one-to-one map between the minimal faces of the image of the primal objective and the maximal faces of the image of the dual objective map.
متن کاملForecasting Using Fuzzy Multiple Objective Linear Programming
The application of fuzzy approach models to forecast has been drawing a lot of attention. This study proposes a fuzzy approach to forecasting using a financial data set. The methodology used is multiple objective linear programming (MOLP). Selecting an individual forecast based upon a single objective may not make the best use of available information for a variety of reasons. Combined forecast...
متن کاملOn duality in multiple objective linear programming
We discuss two approaches to duality for multiple objective linear problems. The first approach is based on a duality relation between a set and its complement in the outcome space. It allows us to obtain a number of known duality constructions. The second approach utilizes polarity between a polyhedral set and the epigraph of its support function. It leads to a parametric dual problem which is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Methods of Operations Research
سال: 2016
ISSN: 1432-2994,1432-5217
DOI: 10.1007/s00186-016-0554-0